Iterative Mesh Segmentation Using Approximated Voronoi Diagram
نویسندگان
چکیده
منابع مشابه
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. The mesh topology is also simplified by the clustering algo...
متن کاملAn L1 Voronoi Diagram Algorithm for a Reconfigurable Mesh
In this paper we introduce an algorithm for computing the Voronoi Diagram using the L1 metric for n planar points on the reconfigurable mesh model of computation. The algorithm contains a new technique of embedding aplanar graph on the mesh using the reconfigurable nature of the architecture.
متن کاملEfficient computation of clipped Voronoi diagram for mesh generation
The Voronoi diagram is a fundamental geometric structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact domain (i.e. a bounded and closed 2D region or a 3D volume), some Voronoi cells of their Voronoi diagram are infinite or partially outside of the domain, but in practice only the parts of the cells inside the domain are ...
متن کاملExploiting Voronoi diagram properties in face segmentation and feature extraction
Segmentation of human faces from still images is a research field of rapidly increasing interest. Although the field encounters several challenges, this paper seeks to present a novel face segmentation and facial feature extraction algorithm for gray intensity images (each containing a single face object). Face location and extraction must first be performed to obtain the approximate, if not ex...
متن کاملPoint Cluster Simplification Using Weighted Voronoi Diagram
This paper proposes an algorithm for simplifying point features on maps based on the multiplicatively weighted Voronoi diagram (MWVD). To ensure statistical, thematic, metric, and topological information contained in the original point features can be transmitted correctly after simplification, the algorithm selects corresponding measures to quantify these four types of information, and integra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Technology
سال: 2015
ISSN: 2212-0173
DOI: 10.1016/j.protcy.2015.02.016